package alg20241116;

public class Text2 {
    public static void main(String[] args) {
        int[][] nums = new int[2][3];
        System.out.println(nums.length);
        System.out.println(nums[0].length);
    }
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        //1 创建表
        int[][] dp = new int[m + 1][n + 1];
        //2 初始化
        dp[0][1] = 1;
        //3 填表
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if(obstacleGrid[i-1][j-1] == 0){
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                }else{
                    dp[i][j] = 0;
                }
            }
        }
        //4 返回值
        return dp[m][n];
    }
}
